Graph minors and graphs on surfaces
نویسنده
چکیده
Graph minors and the theory of graphs embedded in surfaces are fundamentally interconnected. Robertson and Seymour used graph minors to prove a generalization of the Kuratowski Theorem to arbitrary surfaces [37], while they also need surface embeddings in their Excluded Minor Theorem [45]. Various recent results related to graph minors and graphs on surfaces are presented.
منابع مشابه
Random planar graphs and beyond
We survey several results on the enumeration of planar graphs and on properties of random planar graphs. This includes basic parameters, such as the number of edges and the number of connected components, and extremal parameters such as the size of the largest component, the diameter and the maximum degree. We discuss extensions to graphs on surfaces and to classes of graphs closed under minors...
متن کاملGraphs of Small Rank-width Are Pivot-minors of Graphs of Small Tree-width
We prove that every graph of rank-width k is a pivot-minor of a graph of tree-width at most 2k. We also prove that graphs of rank-width at most 1, equivalently distance-hereditary graphs, are exactly vertex-minors of trees, and graphs of linear rank-width at most 1 are precisely vertex-minors of paths. In addition, we show that bipartite graphs of rank-width at most 1 are exactly pivot-minors o...
متن کاملForcing large complete minors in infinite graphs
It is well-known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalise the notion of the relative end degree, which had been previously introduced by the first author for locally finite graphs, and show that large minimum relative degree at the ends and large mi...
متن کاملGraphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width
We prove that every graph of rank-width k is a pivot-minor of a graph of tree-width at most 2k. We also prove that graphs of rank-width at most 1, equivalently distance-hereditary graphs, are exactly vertex-minors of trees, and graphs of linear rank-width at most 1 are precisely vertex-minors of paths. In addition, we show that bipartite graphs of rank-width at most 1 are exactly pivot-minors o...
متن کاملExcluded Minors and the Ribbon Graphs of Knots
In this paper we consider minors of ribbon graphs (or, equivalently, cellularly embedded graphs). The theory of minors of ribbon graphs differs from that of graphs in that contracting loops is necessary and doing this can create additional vertices and components. Thus the ribbon graph minor relation is incompatible with the graph minor relation. We discuss excluded minor characterisations of m...
متن کامل